A Note on Diophantine Quintuples
نویسنده
چکیده
Introduction. Diophantus noted that the rational numbers 1/16, 33/16, 17/4 and 105/16 have the following property: the product of any two of them increased by 1 is a square of a rational number (see [2, 3]). Let n be an integer. A set of positive integers {a1, a2, . . . , am} is said to have the property D(n) if aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. Such a set is called a Diophantine m-tuple. Fermat first found an example of a Diophantine quadruple with the property D(1), and it was {1, 3, 8, 120} (see [2]). In 1985, Brown [1], Gupta and Singh [7] and Mohanty and Ramasamy [9] proved independently that if n ≡ 2 (mod 4), then there does not exist a Diophantine quadruple with the property D(n). If n 6≡ 2 (mod 4) and n 6∈ {−4,−3,−1, 3, 5, 8, 12, 20}, then there exists at least one Diophantine quadruple with the property D(n) (see [4, Theorem 5]. In [5], the definition of Diophantine m-tuples is extended to the rational numbers. Namely, if q is a rational number, the set of non-zero rationals {a1, a2, . . . , am} is called a rational Diophantine m-tuple with the property D(q) if aiaj + q is a square of a rational number for all 1 ≤ i < j ≤ m.
منابع مشابه
The Number of Diophantine Quintuples
A set {a1, . . . , am} of m distinct positive integers is called a Diophantine m-tuple if aiaj + 1 is a perfect square for all i, j with 1 ≤ i < j ≤ m. It is known that there does not exist a Diophantine sextuple and that there exist only finitely many Diophantine quintuples. In this paper, we first show that for a fixed Diophantine triple {a, b, c} with a < b < c, the number of Diophantine qui...
متن کاملThere are only finitely many Diophantine quintuples
A set of m positive integers is called a Diophantine m-tuple if the product of its any two distinct elements increased by 1 is a perfect square. Diophantus found a set of four positive rationals with the above property. The first Diophantine quadruple was found by Fermat (the set {1, 3, 8, 120}). Baker and Davenport proved that this particular quadruple cannot be extended to a Diophantine quint...
متن کاملOn Diophantine quintuples and D(−1)-quadruples
In this paper the known upper bound 10 for the number of Diophantine quintuples is reduced to 6.8·10. The key ingredient for the improvement is that certain individual bounds on parameters are now combined with a more efficient counting of tuples, and estimated by sums over divisor functions. As a side effect, we also improve the known upper bound 4 ·10 for the number of D(−1)-quadruples to 5 ·...
متن کاملOn the number of Diophantine m-tuples
A set of m positive integers is called a Diophantine m-tuple if the product of any two of them is one less than a perfect square. It is known that there does not exist a Diophantine sextuple and that there are only finitely many Diophantine quintuples. On the other hand, there are infinitely many Diophantine m-tuples for m = 2, 3 and 4. In this paper, we derive asymptotic extimates for the numb...
متن کاملOn the size of Diophantine m-tuples
Let n be a nonzero integer. A set of m positive integers {a1, a2, . . . , am} is said to have the property D(n) if aiaj + n is a perfect square for all 1 ≤ i < j ≤ m. Such a set is called a Diophantine m-tuple (with the property D(n)), or Pn-set of size m. Diophantus found the quadruple {1, 33, 68, 105} with the property D(256). The first Diophantine quadruple with the property D(1), the set {1...
متن کامل